On the Complexity of the Numerically Definite Syllogistic and Related Fragments
نویسنده
چکیده
In this paper, we determine the complexity of the satisfiability problem for various logics obtained by adding numerical quantifiers, and other constructions, to the traditional syllogistic. In addition, we demonstrate the incompleteness of some recently proposed proof-systems for these logics.
منابع مشابه
Logics for the Relational Syllogistic
The Aristotelian syllogistic cannot account for the validity of certain inferences involving relational facts. In this paper, we investigate the prospects for providing a relational syllogistic. We identify several fragments based on (a) whether negation is permitted on all nouns, including those in the subject of a sentence; and (b) whether the subject noun phrase may contain a relative clause...
متن کاملThe Data Complexity of the Syllogistic Fragments of English
Pratt and Third’s syllogistic fragments of English can be used to capture, in addition to syllogistic reasoning, many other kinds of common sense reasoning, and, in particular (i) knowledge base consistency and (ii) knowledge base query answering, modulo their FO semantic representations. We show how difficult, in terms of semantic (computational) complexity and data complexity (i.e., computati...
متن کاملA method for analyzing the problem of determining the maximum common fragments of temporal directed tree, that do not change with time
In this study two actual types of problems are considered and solved: 1) determining the maximum common connected fragment of the T-tree (T-directed tree) which does not change with time; 2) determining all maximum common connected fragments of the T-tree (T-directed tree) which do not change with time. The choice of the primary study of temporal directed trees and trees is justified by the wid...
متن کاملTowards a Formalization of Mental Model Reasoning for Syllogistic Fragments
In this study, Johnson-Laird and his colleagues’ mental model reasoning is formally analyzed as a non-sentential reasoning. Based on the recent developments in implementations of mental model theory, we formulate a mental model reasoning for syllogistic fragments in a way satisfying the requirement of formal specification such as mental model definition.
متن کاملOn the satisfiability problem for a 4-level quantified syllogistic and some applications to modal logic
We introduce a multi-sorted stratified syllogistic, called 4LQS, admitting variables of four sorts and a restricted form of quantification over variables of the first three sorts, and prove that it has a solvable satisfiability problem by showing that it enjoys a small model property. Then, we consider the fragments (4LQS) of 4LQS, consisting of 4LQS-formulae whose quantifier prefixes have leng...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/cs/0701039 شماره
صفحات -
تاریخ انتشار 2007